An efficient and almost budget balanced cost sharing method
نویسنده
چکیده
In the residual∗ cost sharing game with a convex technology, the equilibrium demands maximize total surplus, but total payment may differ from the actual cost, and a user with a null demand may be subsidized. If the cost function is totally monotone (e.g., polynomial with positive coefficients, or exponential), participation is voluntary and total payment covers actual cost. The ratio of excess payment to the efficient surplus is no larger than min{ 2 logn , 1}, where n is the number of potential users. For power cost functions, C(a) = ap, p > 1, the above ratio converges to zero as 1 np−1 . Participation appears to be voluntary however a small budget deficit is possible. For analytic cost functions, the ratio converges to zero exponentially when the set of users increases. All properties above are lost if the cost function is not smooth. ∗I am greatly indebted to Fedor Nazarov at Michigan State University, for the crucial insight into the proof of Theorem 1, and to Doug Hensley at Texas A&M, who provided numerical simulations in support of a key conjecture. I am also grateful to participants in the 2006 AGATE workshop in Bertinoro, and in the meetings of the Society for Economic Design in Bodrum. This work is supported by the NSF under grant SES-0414543.
منابع مشابه
The price of anarchy of serial cost sharing and other methods
Users share an increasing marginal cost technology. A method charges non negative cost shares covering costs. We look at the worst surplus (relative to the efficient surplus) in a Nash equilibrium of the demand game, where the minimum is taken over all convex preferences quasilinear in cost shares. We compare two budget-balanced methods, average cost pricing and serial cost sharing, and two met...
متن کاملHardness Results for Multicast Cost Sharing
We continue the study of multicast cost sharing from the viewpoints of both computational complexity and economic mechanism design. We provide fundamental lower bounds on the network complexity of group-strategyproof, budget-balanced mechanisms. We also extend a classical impossibility result in game theory to show that no strategyproof mechanism can be both approximately efficient and approxim...
متن کاملTo Be or Not to Be (Served): Cost Sharing Without Indifferences
In a cost-sharing problem, finitely many players have unknown valuations for some service, and a mechanism is sought for determining which players to serve and how to distribute the incurred cost. An ideal mechanism is collusion-resistant (elicits truthful valuations even if players could collude), budget-balanced (recovers the cost), economically efficient (trades off cost and valuations), and...
متن کاملGroup Strategyproofness and No Subsidy via LP-Duality
We make two contributions to cooperative game theory, both of which rely heavily on linear programming duality theory. First, we introduce a fairness criterion on service providers, which we call No Subsidy. This condition ensures that a subset of the users is not overcharged in order to subsidize another set of users. We completely characterize cost functions that allow cost sharing mechanisms...
متن کاملDistributed Algorithmic Mechanism Design
Distributed Algorithmic Mechanism Design Rahul Sami 2003 Distributed algorithmic mechanism design (DAMD) is an approach to designing distributed systems that takes into account both the distributed-computational environment and the incentives of autonomous agents. In this dissertation, we study two problems, multicast cost sharing and interdomain routing. We also touch upon several issues impor...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Games and Economic Behavior
دوره 70 شماره
صفحات -
تاریخ انتشار 2010